#include<stdio.h>
int prime(int n)
{
    if(n==2)return 1;
    if(n<2||n%2==0)return 0;
    int c;
    for(c=3;c*c<=n;c+=2)
        if(n%c==0)
            return 0;
    return 1;
}
#define N 2000000

int main()
{
    int n,p,find;
    for(n=6;n<=N;n+=2)
    {
        find=0;
        for(p=3;p<=n/2;p+=2)
            if(prime(p)&&prime(n-p))
            {
              // printf("%d=%d+%d\n",n,p,n-p);
               find=1;
               break;
            }

        if(find==0)
            puts("Congratulations! ");

    }
    return 0;
}
